Logical- and Meta-Logical Frameworks Lecture 1 Carsten Sch¨ urmann August 3, 2006

Source URL: www.itu.dk

• Logic in computer science
• Type theory
• Proof theory
• Classical logic
• Semantics
• Logical framework
• Propositional calculus
• Intuitionistic logic
• Negation
• Logic
• Mathematical logic
• Judgment

Verification of a Cryptographic Primitive: SHA-256 ANDREW W. APPEL, Princeton University A full formal machine-checked verification of a C program: the OpenSSL implementation of SHA-256. This is an interactive proof of f

Source URL: www.cs.princeton.edu

• Software engineering
• Programming language theory
• Theoretical computer science
• C++
• Logic in computer science
• Proof assistants
• Data types
• SHA-2
• Formal verification
• Separation logic
• Coq
• Functional programming

Microsoft Word - writproj_title.doc

Source URL: www.cs.sjsu.edu

• Proof assistants
• Software
• Programming language theory
• Functional languages
• Type theory
• Coq
• Agda
• Theorem
• Metamath
• Coenzyme Q10
• Mathematical proof
• Mathematical logic

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

Source URL: www.usenix.org

• Complexity classes
• Circuit complexity
• Computational complexity theory
• Zero-knowledge proof
• Non-interactive zero-knowledge proof
• SM-62 Snark
• XTR
• NC
• NP
• Proof of knowledge
• Computer
• ZK

QUANTUM-PROOF RANDOMNESS EXTRACTORS VIA OPERATOR SPACE THEORY MARIO BERTA, OMAR FAWZI, AND VOLKHER B. SCHOLZ Abstract. Randomness extractors are an important building block for classical and quantum cryptography as well

Source URL: www.quantum-lab.org

Specware to Isabelle Interface Manual Specware to Isabelle Interface Manual Copyright © by Kestrel Development Corporation Copyright © by Kestrel Technology LLC

Source URL: www.specware.org

• Software engineering
• Mathematical logic
• Logic
• Proof assistants
• Type theory
• Logic in computer science
• Automated theorem proving
• Isabelle
• Predicate logic
• HOL
• Quantifier
• ML

Capturing Proof Process Andrius Velykis A thesis submitted for the degree of Doctor of Philosophy

Source URL: andrius.velykis.lt

• Automated theorem proving
• Theoretical computer science
• Logic
• Formal methods
• Mathematics
• Logic in computer science
• Proof theory
• Mathematical proof
• Proof assistant
• Isabelle
• Theorem
• Proof

Meta-Logical Frameworks and Formal Digital Libraries ? Carsten Sch¨ urmann Department of Computer Science

Source URL: www.itu.dk

• Theoretical computer science
• Mathematical logic
• Logic in computer science
• Type theory
• Proof assistants
• Mathematics
• Automated theorem proving
• Isabelle
• Logical framework
• Twelf
• Formal methods
• Automated reasoning

A Nelson-Oppen based Proof System using Theory Specific Proof Systems∗ Fr´ed´eric Besson, Pierre-Emmanuel Cornilleau, David Pichardie INRIA Rennes – Bretagne Atlantique, France Abstract SMT solvers are nowadays per

Source URL: pxtp2011.loria.fr

A Proof of Arrow’s Theorem The following proof is used in Austen-Smith and Banks’s Positive Political Theory, Volume I. The actual proof of the theorem relies on a lemma, which we will prove first. The lemma requires

Source URL: www.cs.wustl.edu